On primitive elements in finite fields of low characteristic
نویسندگان
چکیده
We discuss the problem of constructing a small subset of a finite field containing primitive elements of the field. Given a finite field, Fqn , small q and large n, we show that the set of all low degree polynomials contains the expected number of primitive elements. The main theorem we prove is a bound for character sums over short intervals in function fields. Our result is unconditional and slightly better than what is known (conditionally under GRH) in the integer case and might be of independent interest.
منابع مشابه
Finding Primitive Elements in Finite Fields of Small Characteristic
We describe a deterministic algorithm for finding a generating element of the multiplicative group of the finite field with p elements. In time polynomial in p and n, the algorithm either outputs an element that is provably a generator or declares that it has failed in finding one. Under a heuristic assumption, we argue that the algorithm does always succeed in finding a generator. The algorith...
متن کامل3.1 Arithmetic in Finite Fields 3.2 Addition
To make explicit computations with elliptic curves over finite fields, we need to know how to perform arithmetic operations in finite fields, and we would like to do so as efficiently as possible. In the applications we will consider, the finite fields involved may be very large, so it is important to understand the asymptotic complexity of finite field operations. This is a huge topic, one to ...
متن کاملDivisibility of polynomials over finite fields and combinatorial applications
Consider a maximum-length shift-register sequence generated by a primitive polynomial f over a finite field. The set of its subintervals is a linear code whose dual code is formed by all polynomials divisible by f . Since the minimum weight of dual codes is directly related to the strength of the corresponding orthogonal arrays, we can produce orthogonal arrays by studying divisibility of polyn...
متن کاملOn Primitive Elements in Differentially Algebraic Extension Fields
It is well known that if Fis a field of characteristic zero and K=F(ax,..., ot„) is a finite algebraic extension of F, then K contains a primitive element, i.e. an element a such that F(oti,..., an) = F(a). Moreover, by means of Galois theory, it is possible to characterize those elements of the extension field which are primitive. In the case of finite differentially algebraic extensions the t...
متن کاملNormal bases and primitive elements over finite fields
Let q be a prime power, m ≥ 2 an integer and A = ( a b c d ) ∈ GL2(Fq), where A 6= ( 1 1 0 1 ) if q = 2 and m is odd. We prove an extension of the primitive normal basis theorem and its strong version. Namely, we show that, except for an explicit small list of genuine exceptions, for every q, m and A, there exists some primitive x ∈ Fqm such that both x and (ax+b)/(cx+d) produce a normal basis ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Finite Fields and Their Applications
دوره 35 شماره
صفحات -
تاریخ انتشار 2015